Theoretical analysis of a correlation attack based on convolutional codes
نویسندگان
چکیده
One general class of attacks on stream ciphers is correlation attacks. Most of previous results regarding performance of correlation attacks have been based entirely on simulations. In this paper, we use random coding bounds for convolutional codes to give a theoretical analysis of a previously proposed correlation attack based on convolutional codes. The results from the theoretical derivation are verified by simulations.
منابع مشابه
Improved Fast Correlation Attacks Using Parity-Check Equations
This paper describes new techniques for fast correlation attacks, based on Gallager iterative decoding algorithm using parity-check equations of weight greater than 3. These attacks can be applied to any key-stream generator based on LFSRs and it does not require that the involved feedback polynomial have a low weight. We give a theoretical analysis of all fast correlation attacks, which shows ...
متن کاملImproved Fast Correlation Attacks Using Parity-Check Equations of Weight 4 and 5
This paper describes new techniques for fast correlation attacks, based on Gallager iterative decoding algorithm using parity-check equations of weight greater than 3. These attacks can be applied to any key-stream generator based on LFSRs and it does not require that the involved feedback polynomial have a low weight. We give a theoretical analysis of all fast correlation attacks, which shows ...
متن کاملImproved Fast Correlation Attacks on Stream Ciphers via Convolutional Codes
This paper describes new methods for fast correlation attacks, based on the theory of convolutional codes. They can be applied to arbitrary LFSR feedback polynomials, in opposite to the previous methods, which mainly focus on feedback polynomials of low weight. The results improve significantly the few previous results for this general case, and are in many cases comparable with corresponding r...
متن کاملCorrelation Attacks on Stream Cipher
Correlation attacks on stream cipher are divide and conquer attacks applied to nonlinear combination generators based on linear feedback shift registers. These are cipher text only attacks that exploit the correlation between the cipher text and the underlying shift register sequences to recover the initial state of the underlying LFSRs. Fast correlation attacks are based on use of parity check...
متن کاملConvolutional Codes based FCA when Combiner Function is 1-CI
Convolution Code based Fast Correlation Attacks (FCA) are a powerful class of attacks on stream ciphers. Thus stream ciphers are designed so that combiner function is correlation immune. In this paper we propose a method to apply Convolution Code based FCA when the combiner function is first order correlation immune (1-CI) but not 2-CI. We apply the attack on a pair of LFSRs whose sum sequence ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 48 شماره
صفحات -
تاریخ انتشار 2002